Reinforcing Web-object Categorization Through Interrelationships
نویسندگان
چکیده
منابع مشابه
Web prefetching through automatic categorization
The present report provides a novel transparent and speculative algorithm for content based web page prefetching. The proposed algorithm relies on a user profile that is dynamically generated when the user is browsing the Internet and is updated over time. The objective is to reduce the user perceived latency by anticipating future actions. In doing so the adaboost algorithm is used in order to...
متن کاملImproving Recognition through Object Sub-categorization
We propose a method to improve the recognition rate of Bayesian classifiers by splitting the training data and using separate classifier to learn each sub-category. We use probabilistic Latent Semantic Analysis (pLSA) to split the training set automatically into subcategories. This sub-categorization is based on the similarity of training images in terms of object’s appearance or background con...
متن کاملObject Categorization through Annotated Reeb Graph and Grasping by Parts
Recently, the proliferation of cheap and effective sensor devices for 3D perception, like depth cameras and 3D laser systems, has promoted the development of accurate and detailed object detection. The perception, representation and classification of objects is not only relevant for navigation tasks and semantic description of unstructured environments, but also has great importance for robot m...
متن کاملOn the Management of Object Interrelationships
Still one of the main problems in computing security is the scope malicious intruders can gain by introducing their own thread of control. To make this worse, coarse grained structures of current operating systems are not designed to contain such breaches. So essentially the task of maintaining security lies not only with the operating system, but also within the attacked process. Obviously how...
متن کاملReinforcing Parser Preferences through Tagging
Lexical ambiguity is an important source of inefficiency for wide-coverage HPSG parsing. In this paper, we propose a lexical analysis filter which removes unlikely lexical categories. The filter is implemented as a straightforward HMM n-gram POS-tagger, which computes the ’a posteriori’ probability of each lexical category. A lexical category is removed if a competing lexical category is suffic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Mining and Knowledge Discovery
سال: 2006
ISSN: 1384-5810,1573-756X
DOI: 10.1007/s10618-005-0015-5